Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case

نویسندگان

  • Hoon Hong
  • Manfred Minimair
چکیده

The main question of this paper is: What happens to sparse resultants under composition? More precisely, let f1, . . . , fn be homogeneous sparse polynomials in the variables y1, . . . , yn and g1, . . . , gn be homogeneous sparse polynomials in the variables x1, . . . , xn. Let fi ◦ (g1, . . . , gn) be the sparse homogeneous polynomial obtained from fi by replacing yj by gj . Naturally a question arises: Is the sparse resultant of f1 ◦ (g1, . . . , gn) , . . . , fn◦(g1, . . . , gn) in any way related to the (sparse) resultants of f1, . . . , fn and g1, . . . , gn? The main contribution of this paper is to provide an answer for the case when g1, . . . , gn are unmixed, namely, ResC1,...,Cn (f1 ◦ (g1, . . . , gn) , . . . , fn ◦ (g1, . . . , gn)) = Resd1,...,dn (f1, . . . , fn) Vol(Q) ResB (g1, . . . , gn) d1···dn , where Res d1,...,dn stands for dense (Macaulay) resultant with respect to the total degrees di of the fi’s, ResB stands for unmixed sparse resultant Originally titled “A Chain Rule for Sparse Resultants”. Partially supported by NSF project “Computing with composed functions”, NSF CCR9972527

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact matrix formula for the unmixed resultant in three variables

We give the first exact determinantal formula for the resultant of an unmixed sparse system of four Laurent polynomials in three variables with arbitrary support. This follows earlier work by the author on exact formulas for bivariate systems and also uses the exterior algebra techniques of Eisenbud and Schreyer.

متن کامل

Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants

Resultants are defined in the sparse (or toric) context in order to exploit the structure of the polynomials as expressed by their Newton polytopes. Since determinantal formulae are not always possible, the most efficient general method for computing resultants is as the ratio of two determinants. This is made possible by Macaulay’s seminal result [15] in the dense homogeneous case, extended by...

متن کامل

An E cient Algorithm for the Sparse Mixed Resultant

We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be de ned as the GCD of n + 1 such d...

متن کامل

An Efficient Algorithm for the Sparse Mixed Resultant

We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be deened as the GCD of n + 1 such d...

متن کامل

The resultant of an unmixed bivariate system

This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid Sylvester and Bézout type. The results extend those in [14] by giving a complete combinatorial description of the matrix. Previous work by D’Andrea [5] gave pure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2002